Minimum-area enclosing triangle with a fixed angle
نویسندگان
چکیده
منابع مشابه
Minimum-area enclosing triangle with a fixed angle
Given a set S of n points in the plane and a fixed angle 0 < ω < π, we show how to find all triangles of minimum area with angle ω that enclose S in O(n log n) time. We also demonstrate that in general, the solution cannot be written without cubic root.
متن کاملMinimum enclosing area triangle with a fixed angle
Given a set S of n points in the plane and a fixed angle 0 < ω < π, we show how to find all triangles of minimum area with angle ω that enclose S in O(n log n) time.
متن کاملIsoperimetric Triangular Enclosure with a Fixed Angle
Given a set S of n > 2 points in the plane (in general position), we show how to compute in O(n) time, a triangle T with maximum (or minimum) area enclosing S among all enclosing triangles with fixed perimeter P and one fixed angle ω. We show that a similar approach can be used to compute a triangle T with maximum (or minimum) perimeter enclosing S among all enclosing triangles with fixed area ...
متن کاملMinimum Volume Enclosing Ellipsoids
Two different methods for computing the covering ellipses of a set of points are presented. The first method finds the optimal ellipsoids with the minimum volume. The second method uses the first and second moments of the data points to compute the parameters of an ellipsoid that covers most of the points. A MATLAB software is written to verify the results.
متن کاملMinimum Enclosing Circle with Few Extra Variables
Asano et al. [JoCG 2011] proposed an open problem of computing the minimum enclosing circle of a set of n points in R2 given in a read-only array in sub-quadratic time. We show that Megiddo’s prune and search algorithm for computing the minimum radius circle enclosing the given points can be tailored to work in a read-only environment in O(n1+ ) time using O(logn) extra space, where is a positi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2014
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2013.07.002